Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Clustering routing algorithm based on attraction factor and hybrid transmission
ZHAO Zuopeng, ZHANG Nana, HOU Mengting, GAO Meng
Journal of Computer Applications    2015, 35 (12): 3331-3335.   DOI: 10.11772/j.issn.1001-9081.2015.12.3331
Abstract424)      PDF (913KB)(361)       Save
In order to effectively reduce the energy consumption of Wireless Sensor Network (WSN) and extend the life cycle of the network, Low Energy Adaptive clustering Hierarchy (LEACH) and other clustering routing protocols were analyzed. For improving their weaknesses, a Clustering Routing algorithm based on Attraction factor and Hybrid transmission (CRAH algorithm) was proposed. Firstly, in order to solve the problem of unreasonable selection of Cluster Head (CH) nodes, the node residual energy and the node location were combined as a new index of CH nodes selection by adopting the method of weighted sum. Then, the tasks of the CH nodes were reassigned, and new fusion nodes were chosen. The fusion nodes sent data to Base Station (BS) according to a hybrid of single hop and multiple hops, and combined attraction factor and the Dijkstra algorithm to present a new algorithm, Attraction Factor-Dijkstra (AF-DK) algorithm was proposed with the combination of attract factor and Dijkstra algorithm for finding the optimal paths for fusion nodes. The simulation results show that, compared with the protocols of LEACH, LEACH-Centralized (LEACH-C) and Hybrid Energy-Efficient Distributed clustering (HEED), the CRAH algorithm improved the network lifetime by about 51.56%, 47.1% and 42% respectively, and slowed the network energy consumption significantly. The amount of data receiving by Base Station (BS) decreased 69.9% in average. The CRAH algorithm makes CH selection more reasonable, effectively reduces the redundant data in the process of communication, balances the network energy consumption, and extends the life cycle of the network.
Reference | Related Articles | Metrics